Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
921	jn2004[removed]Complexity: P & NP Goals of this chapter: Given a model of computation and a measure of complexity of computations, it is possible to define the inherent complexity of a class of problems. This is a lowe Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2004-11-18 06:12:14 Complexity classes NP-complete problems Mathematical optimization Boolean algebra NP-complete Boolean satisfiability problem P versus NP problem NP Clique problem Theoretical computer science Computational complexity theory Applied mathematics
922	Interaction between algorithms and data structures: Case studies in geometric computation 1 Part VI Interaction between Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-03-03 14:53:31 Computational geometry Algorithm Solid modeling Closest pair of points problem Computer science Sweep line algorithm Year of birth missing Geometry Mathematics Computer-aided design
923	Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power J¨ urg Nievergelt Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-03-03 14:42:58 Search algorithms Computational complexity theory Complexity classes Combinatorial optimization Algorithm Distributed computing NP Tree traversal Travelling salesman problem Theoretical computer science Applied mathematics Mathematics
924	7. Complexity: P & NP Optimization Problems find an optimal solution, most common in praxis implies Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-11-28 16:45:16 Complexity classes NP P versus NP problem Boolean satisfiability problem P Time complexity Optimization problem Reduction Cook–Levin theorem Theoretical computer science Computational complexity theory Applied mathematics
925	INDEX Next Fit, 4{5, 25, 27{30 Smart, 28, 30 Next Fit Decreasing, 17, 41, 44 Next-K Fit, 5, 9{11, 25, 28 Add to Reading List Source URL: www.math.nsc.ru Language: English - Date: 2005-03-04 05:08:14 Analysis of algorithms Operations research Convex optimization Bin packing problem Discrete geometry Combinatorial optimization Packing problem Linear programming Randomized algorithm Theoretical computer science Mathematics Computational complexity theory
926	Ch 7 Approximation algorithms, online algorithms Bertrand Russell[removed]): Although this may seem a paradox, all exact science is dominated by the idea of approximation. 7.1 Minimum spanning tree approximation to the Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-04-08 10:39:43 NP-complete problems Operations research Spanning tree Travelling salesman problem Vertex cover Job shop scheduling Minimum spanning tree Matching Approximation algorithm Theoretical computer science Mathematics Computational complexity theory
927	The closest pair problem 26 1 Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-02-14 10:46:29 Discrete geometry Closest pair of points problem Proximity problems Voronoi diagram Bentley–Ottmann algorithm OPTICS algorithm Geometry Mathematics Computational geometry
928	Creativity and ICT FET Consultation Workshop Brussels, 28 November[removed]Report Add to Reading List Source URL: cordis.europa.eu Language: English - Date: 2012-01-16 04:12:18 Cognition Educational psychology Positive psychology Computational creativity Psychology Cognitive science Incubation Marci Segal Creative problem solving Problem solving Mind Creativity
929	Region of Attraction Estimation for a Perching Aircraft: A Lyapunov Method Exploiting Barrier Certificates Elena Glassman, Alexis Lussier Desbiens, Mark Tobenkin, Mark Cutkosky, and Russ Tedrake Abstract— Dynamic perch Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2013-02-21 10:14:22 Polynomial Mathematical optimization Lyapunov equation Mathematics Applied mathematics Theoretical computer science Computational problems Operations research Optimization problem
930	Properties of NP-Complete Sets Christian Glaßer, A. Pavan, Alan L. Selman, Samik Sengupta ∗ † Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2004-01-15 13:02:20 Complexity classes NP P versus NP problem PP Sparse language P Cook–Levin theorem NP-hard Theoretical computer science Computational complexity theory Applied mathematics

UPDATE